What , if anything , are topological maps for ? Stuart
نویسندگان
چکیده
What, if anything, is the functional significance of spatial patterning in cortical feature maps? We ask this question of four major theories of cortical map formation: self-organizing maps, wiring optimization, place coding, and reaction-diffusion. We argue that i) self-organizing maps yield spatial patterning only as a byproduct of efficient mechanisms for developing environmentally appropriate distributions of feature preferences, ii) wiring optimization assumes rather than explains a map-like organization, iii) place-coding mechanisms can at best explain only a subset of maps in functional terms, and iv) reaction-diffusion models suggest two factors in the evolution of maps, the first based on efficient development of feature distributions, and the second based on generating feature-specific long-range recurrent cortical circuitry. None of these explanations for the existence of topological maps requires spatial patterning in maps to be useful. Thus despite these useful frameworks for understanding how maps form and how they are wired, the possibility that patterns are merely epiphenomena in the evolution of mammalian neocortex cannot be rejected. The paper is intended as a non-technical introduction to the assumptions and predictions of these four important classes of models, along with other possible functional explanations for maps.
منابع مشابه
On topological transitive maps on operator algebras
We consider the transitive linear maps on the operator algebra $B(X)$for a separable Banach space $X$. We show if a bounded linear map is norm transitive on $B(X)$,then it must be hypercyclic with strong operator topology. Also we provide a SOT-transitivelinear map without being hypercyclic in the strong operator topology.
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملCounting Preimages
For noninvertible maps, mainly subshifts of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, random in the sense that at each step every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way. It tuns out that instead of the topological entropy we get the metric ...
متن کاملω-NARROWNESS AND RESOLVABILITY OF TOPOLOGICAL GENERALIZED GROUPS
Abstract. A topological group H is called ω -narrow if for every neighbourhood V of it’s identity element there exists a countable set A such that V A = H = AV. A semigroup G is called a generalized group if for any x ∈ G there exists a unique element e(x) ∈ G such that xe(x) = e(x)x = x and for every x ∈ G there exists x − 1 ∈ G such that x − 1x = xx − 1 = e(x). Also le...
متن کاملEntropy of a semigroup of maps from a set-valued view
In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between Hausdorff metric entropy and topological entropy of a semigroup defined by Bis. Some examples with positive or zero Hausdorff metric entropy are given. Moreov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015